The orienteering problem: A survey
نویسندگان
چکیده
منابع مشابه
The orienteering problem: A survey
During the last decade, a number of challenging applications in logistics, tourism and other fields were modelled as orienteering problems (OP). In the orienteering problem, a set of vertices is given, each with a score. The goal is to determine a path, limited in length, that visits some vertices and maximises the sum of the collected scores. In this paper, the literature about the orienteerin...
متن کاملThe probabilistic orienteering problem
The probabilistic orienteering problem (POP) is defined on a directed graph where a cost is associated with each arc and a prize is associated with each node. Moreover, each node will be available for visit only with a certain probability. A server starts from a fixed origin, has a given time limit to visit a subset of nodes, and ends at a fixed destination. In a first stage, a node subset has ...
متن کاملThe Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r ∈ P , and a length constraint B, one needs to find a path starting from r that visits as many points of P as possible and of length not exceeding B. We present a (1 − ε)-approximation algorithm for this problem that runs in nO(1/ε) time; the computed path visits at least (1 − ε)kopt points of...
متن کاملHybrid Heuristic for the Clustered Orienteering Problem
This paper addresses the Clustered Orienteering Problem, a recent variant of the Orienteering Problem. In this variant, customers are grouped into subsets called clusters. A profit is assigned to each cluster and is collected only if all customers belonging to the cluster are served. The objective is to visit the customers of a subset of clusters in order to maximize the total collected profit ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2011
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2010.03.045